Space–time trade-offs for finding shortest unique substrings and maximal unique matches
نویسندگان
چکیده
منابع مشابه
Space-Time Trade-Offs for the Shortest Unique Substring Problem
Given a string X[1, n] and a position k ∈ [1, n], the Shortest Unique Substring of X covering k, denoted by Sk, is a substring X[i, j] of X which satisfies the following conditions: (i) i ≤ k ≤ j, (ii) i is the only position where there is an occurrence of X[i, j], and (iii) j − i is minimized. The best-known algorithm [Hon et al., ISAAC 2015] can find Sk for all k ∈ [1, n] in time O(n) using t...
متن کاملSpace-Economical Algorithms for Finding Maximal Unique Matches
We show space-economical algorithms for finding maximal unique matches (MUM’s) between two strings which are important in large scale genome sequence alignment problems. Our algorithms require only O(n) bits (O(n/ log n) words) where n is the total length of the strings. We propose three algorithms for different inputs: In case the input is only the strings, their compressed suffix array, or th...
متن کاملTight Bounds on the Maximum Number of Shortest Unique Substrings
A substring Q of a string S is called a shortest unique substring (SUS) for interval [s, t] in S, if Q occurs exactly once in S, this occurrence of Q contains interval [s, t], and every substring of S which contains interval [s, t] and is shorter than Q occurs at least twice in S. The SUS problem is, given a string S, to preprocess S so that for any subsequent query interval [s, t] all the SUSs...
متن کاملTight bound on the maximum number of shortest unique substrings
A substring Q of a string S is called a shortest unique substring (SUS) for position p in S, if Q occurs exactly once in S, this occurrence of Q contains position p, and every substring of S which contains position p and is shorter than Q occurs at least twice in S. The SUS problem is, given a string S, to preprocess S so that for any subsequent query position p all the SUSs for position p can ...
متن کاملRayleigh matches and unique green
There are recurrent reports that Rayleigh matches are bimodally distributed in the colour-normal male population. Similar claims have been made for the distribution of the spectral locus of unique green. Moreover, a positive correlation has sometimes been reported between Rayleigh matches and unique green. Using a computer-controlled Maxwellian colorimeter and bias-free psychophysical methods, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2017
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2017.08.002